Greedy Randomized Adaptive Search Procedures (grasp)

نویسنده

  • MAURICIO G.C. RESENDE
چکیده

This paper is a survey of greedy randomized adaptive search procedures (GRASP). GRASP is a multi-start or iterative procedure where each GRASP iteration consists of a construction phase, where a feasible solution is constructed, followed by a local search procedure that finds a locally optimal solution. The construction phase of GRASP is essentially a randomized greedy algorithm. Repeated applications of the construction procedure yields diverse starting solutions for the local search. We review a basic GRASP, followed by enhancements to the basic procedure. We conclude by surveying operations research and industrial applications of GRASP.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fitting the Three-parameter Weibull Distribution by using Greedy Randomized Adaptive Search Procedure

The Weibull distribution is widely employed in several areas of engineering because it is an extremely flexible distribution with different shapes. Moreover, it can include characteristics of several other distributions. However, successful usage of Weibull distribution depends on estimation accuracy for three parameters of scale, shape and location. This issue shifts the attentions to the requ...

متن کامل

Greedy Randomized Adaptive Search Procedures

GRASP (greedy randomized adaptive search procedure) is a metaheuristic for combinatorial optimization. GRASP usually is implemented as a multistart procedure, where each iteration is made up of a construction phase, where a randomized greedy solution is constructed, and a local search phase which starts at the constructed solution and applies iterative improvement until a locally optimal soluti...

متن کامل

Metaheuristic Hybridization with Grasp

GRASP, or greedy randomized adaptive search procedure, is a multi-start metaheuristic that repeatedly applies local search starting from solutions constructed by a randomized greedy algorithm. In this chapter we consider ways to hybridize GRASP to create new and more effective metaheuristics. We consider several types of hybridizations: constructive procedures, enhanced local search, memory str...

متن کامل

Greedy Randomized Adaptive Search Procedures

GRASP is an iterative multi-start metaheuristic for solving difficult combinatorial problems. Each GRASP iteration consists of two phases: a greedy adaptive randomized construction phase and a local search phase. Starting from the feasible solution built during the greedy adaptive randomized construction phase, the local search explores its neighborhood until a local optimum is found. The best ...

متن کامل

Parallel Greedy Randomized Adaptive Search Procedures

A GRASP (Greedy Randomized Adaptive Search Procedure) is a metaheuristic for producing good-quality solutions of combinatorial optimization problems. It is usually implemented with a construction procedure based on a greedy randomized algorithm followed by local search. In this Chapter, we survey parallel implementations of GRASP. We describe simple strategies to implement independent parallel ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995